Critical dimensions for random walks on random-walk chains

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Critical dimensions for random walks on random-walk chains.

The probability distribution of random walks on linear structures generated by random walks in d-dimensional space, Pd(r, t), is analytically studied for the case ξ ≡ r/t1/4 ≪ 1. It is shown to obey the scaling form Pd(r, t) = ρ(r)tξfd(ξ), where ρ(r) ∼ r 2−d is the density of the chain. Expanding fd(ξ) in powers of ξ, we find that there exists an infinite hierarchy of critical dimensions, dc = ...

متن کامل

Random walk on random walks

In this paper we study a random walk in a one-dimensional dynamic random environment consisting of a collection of independent particles performing simple symmetric random walks in a Poisson equilibrium with density ρ ∈ (0,∞). At each step the random walk performs a nearest-neighbour jump, moving to the right with probability p◦ when it is on a vacant site and probability p• when it is on an oc...

متن کامل

6.895 Randomness and Computation 1 Random Walks 1.1 Markov Chains 1.2 Random Walk on a Graph

1.1 Markov Chains Let Ω be a set of states (for the purposes of this class, Ω is always finite, so we can think of it as nodes in a graph). A Markov chain is a sequence of random variables X0, X1, . . . , Xt ∈ Ω that obey the “Markovian property”, that is, Pr[Xt+1 = y|X0 = x0, X1 = x1, . . . , Xt = xt] = Pr[Xt+1 = y|Xt = xt]. One can think of Xi’s as states visited in consecutive steps. The Mar...

متن کامل

Diffusivity of a random walk on random walks

We consider a random walk ( Z (1) n , · · · , Z n ) ∈ Z with the constraint that each coordinate of the walk is at distance one from the following one. In this paper, we show that this random walk is slowed down by a variance factor σ K = 2 K+2 with respect to the case of the classical simple random walk without constraint.

متن کامل

Random walks and Markov chains

This lecture discusses Markov chains, which capture and formalize the idea of a memoryless random walk on a finite number of states, and which have wide applicability as a statistical model of many phenomena. Markov chains are postulated to have a set of possible states, and to transition randomly from one state to a next state, where the probability of transitioning to a particular next state ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Physical Review E

سال: 1996

ISSN: 1063-651X,1095-3787

DOI: 10.1103/physreve.54.3606